Optimal placement of storage nodes in a wireless sensor network

نویسندگان

  • Gianlorenzo D'Angelo
  • Daniele Diodati
  • Alfredo Navarra
  • Maria Cristina Pinotti
چکیده

Networks of sensor nodes are usually employed to monitor large areas, collecting data with regular frequency. This large volume of data has to be stored somewhere for answering to external user queries [3]. There are usually two main ways to store data. Source nodes, which are responsible for collecting data, can either locally store the data or transmit them to the sink, a powerful node connected to the external world. Both solutions present some disadvantages. If data are locally stored, several problems may arise: (i) data cannot be accumulated for long periods because nodes are equipped with only limited memory space; (ii) stored data are lost once the energy of a source node – battery operated – is depleted; and (iii) searching data for serving query demand results in networkwide communications. Alternatively, source nodes can forward the collected data to the sink. However, communicating data from the source nodes up to the sink makes the network congested, especially if data are transmitted raw, that is, uncompressed. Limitations to the number of packets a sensor can transmit to the sink per time unit must be also considered [2]. Recently [9, 10], a hybrid solution has been proposed which makes use of a limited number of “special” sensors, more powerful than standard ones in terms of storage, energy, and computational capabilities. Under this model, source nodes may forward their raw data to such special nodes, referred to as storage nodes. Here, raw data are stored and compressed, i.e., reduced in size, to be transmitted to the sink at the time a query demand from external users is submitted. With this two-tier model, if the number of storage nodes is kept limited, the network becomes less congested at the price of a moderate increase of the sensor cost of the network. Indeed, the integration of storage nodes in the tiered architecture for sensor networks is made possible by the new storage-enriched hardware [6, 11] considered to be very practical [5]. The introduction of the storage nodes helps to alleviate the transmission bandwidth problem by distributing the local data transmission to the storage nodes. This hierarchical structure has been instantiated by the popular stargate device [11] and the memory-enhanced sensor nodes by UC Riverside [6]. Those special powerful nodes take advantage of their high transmission, storage and even computational capabilities to alleviate the bandwidth limitation, and also provide auxiliary support for surrounding vulnerable sensors for data back-up. In [9, 10] the problem of selecting a subset

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quasi Random Deployment Strategy for Reliable Communication Backbones in Wireless Sensor Networks

Topology construction and topology maintenance are significant sub-problems of topology control. Spanning tree based algorithms for topology control are basically transmission range based type construction algorithms. The construction of an effective backbone, however, is indirectly related to the placement of nodes. Also, the dependence of network reliability on the communication path undertak...

متن کامل

A Hierarchy Topology Design Using a Hybrid Evolutionary Algorithm in Wireless Sensor Networks

Wireless sensor network a powerful network contains many wireless sensors with limited power resource, data processing, and transmission abilities. Wireless sensor capabilities including computational capacity, radio power, and memory capabilities are much limited. Moreover, to design a hierarchy topology, in addition to energy optimization, find an optimum clusters number and best location of ...

متن کامل

An Adaptive LEACH-based Clustering Algorithm for Wireless Sensor Networks

LEACH is the most popular clastering algorithm in Wireless Sensor Networks (WSNs). However, it has two main drawbacks, including random selection of cluster heads, and direct communication of cluster heads with the sink. This paper aims to introduce a new centralized cluster-based routing protocol named LEACH-AEC (LEACH with Adaptive Energy Consumption), which guarantees to generate balanced cl...

متن کامل

Random Key Pre-Distribution Techniques against Sybil Attacks

Sybil attacks pose a serious threat for Wireless Sensor Networks (WSN) security. They can create problems in routing, voting schemes, decision making, distributed storage and sensor re-programming. In a Sybil attack, the attacker masquerades as multiple sensor identities that are actually controlled by one or a few existing attacker nodes. Sybil identities are fabricated out of stolen keys, obt...

متن کامل

An Efficient Routing Algorithm to Lifetime Expansion in Wireless Sensor Networks

This paper proposes an efficient network architecture to improve energy consumption in Wireless Sensor Networks (WSN). The proposed architecture uses a mobile data collector to a partitioned network. The mobile data collector moves to center of each logical partition after each decision period. The mobile data collector must declare its new location by packet broadcasting to all sensor node...

متن کامل

An Efficient Routing Algorithm to Lifetime Expansion in Wireless Sensor Networks

This paper proposes an efficient network architecture to improve energy consumption in Wireless Sensor Networks (WSN). The proposed architecture uses a mobile data collector to a partitioned network. The mobile data collector moves to center of each logical partition after each decision period. The mobile data collector must declare its new location by packet broadcasting to all sensor node...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014